Cayley Bipolar Fuzzy Graphs
نویسندگان
چکیده
We introduce the concept of Cayley bipolar fuzzy graphs and investigate some of their properties. We present some interesting properties of bipolar fuzzy graphs in terms of algebraic structures. We also discuss connectedness in Cayley bipolar fuzzy graphs.
منابع مشابه
A NEW MULTIPLE CRITERIA DECISION-MAKING METHOD BASED ON BIPOLAR FUZZY SOFT GRAPHS
In this research study, we present a novel frame work for handling bipolar fuzzy soft information by combining bipolar fuzzy soft sets with graphs. We introduce several basic notions concerning bipolar fuzzy soft graphs and investigate some related properties. We also consider the application of the bipolar fuzzy soft graphs. In particular, three efficient algorithms are developed to solve mult...
متن کاملSome results on Bipolar Fuzzy Graph
In this paper, the notion ofgraph operationsdisjunction and symmetric difference on bipolar fuzzy graphs are defined and it is proved that the new graph is a bipolar graph. Furthermore,the new concepts of bipolar fuzzy graphs calledupperstrong and lower strongbipolar fuzzy graphare introduced and some related </...
متن کاملOn the eigenvalues of normal edge-transitive Cayley graphs
A graph $Gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma)$, respectively. Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$. Then, $Gamma$ is said to be normal edge-transitive, if $N_{Aut(Gamma)}(G)$ acts transitively on edges. In this paper, the eigenvalues of normal edge-tra...
متن کاملSome Connectivity Concepts in Bipolar Fuzzy Graphs
In this article, we introduce some connectivity concepts in bipolar fuzzy graphs. Analogous to fuzzy cutvertices and fuzzy bridges in fuzzy graphs, bipolar fuzzy cutvertices and bipolar fuzzy bridges are introduced and characterized. We also propose the concepts of gain and loss for paths and pairs of vertices. Connectivity in complete bipolar fuzzy graphs is also discussed.
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013